Gauss-Kronrod Integration Rules for Cauchy Principal Value Integrals
نویسندگان
چکیده
منابع مشابه
Gauss-Kronrod Integration Rules for Cauchy Principal Value Integrals
Kronrod extensions to two classes of Gauss and Lobatto integration rules for the evaluation of Cauchy principal value integrals are derived. Since in one frequently occurring case, the Kronrod extension involves evaluating the derivative of the integrand, a new extension is introduced using n + 2 points which requires only values of the integrand. However, this new rule does not exist for all n...
متن کاملGauss Type Quadrature Rules for Cauchy Principal Value Integrals
Two quadrature rules for the approximate evaluation of Cauchy principal value integrals, with nodes at the zeros of appropriate orthogonal polynomials, are discussed. An expression for the truncation error, in terms of higher order derivatives, is given for each rule. In addition, two theorems, containing sufficient conditions for the convergence of the sequence of quadrature rules to the integ...
متن کاملGeneralized Noninterpolatory Rules for Cauchy Principal Value Integrals
Consider the Cauchy principal value integral I(kf;X)=i k{x)F^Ldx, -1<A<1. 7-1 x — A If we approximate f(x) by Yli=oajP¡(x'i w) where {p } is a sequence of orthonormal polynomials with respect to an admissible weight function w and û, = (/. P.), then an approximation to I(kf; X) is given by X!/=o ajl(kp¡ ; ^)If, in turn, we approximate a¡ by ajm = £TM , wimf(x¡m)Pj(xim), then we get a double seq...
متن کاملGauss-Legendre principal value integration
few problems lend themselves to closed-form solution, we often need to convert formal definitions into practical numerical methods. One such problem deals with the Principal Value integral, which many students encounter in a course on functions of a complex variable. However, the prospect of evaluating one numerically might seem rather daunting. To the best of my knowledge, the subject remains ...
متن کاملComputation of Gauss-Kronrod quadrature rules
Recently Laurie presented a new algorithm for the computation of (2n+1)-point Gauss-Kronrod quadrature rules with real nodes and positive weights. This algorithm first determines a symmetric tridiagonal matrix of order 2n+ 1 from certain mixed moments, and then computes a partial spectral factorization. We describe a new algorithm that does not require the entries of the tridiagonal matrix to b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1983
ISSN: 0025-5718
DOI: 10.2307/2007766